Domain decomposition approach for parallel improvement of tetrahedral meshes

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Domain Decomposition Approach for Automatic Parallel Generation of Tetrahedral Grids

The desire to simulate more and more geometrical and physical features of technical structures and the availability of parallel computers and parallel numerical solvers which can exploit the power of these machines have lead to a steady increase in the number of grid elements used. Memory requirements and computational time are too large for usual serial PCs. An a priori partitioning algorithm ...

متن کامل

Parallel Refinement and Coarsening of Tetrahedral Meshes

This paper presents a parallel adaptation procedure (coarsening and re nement) for tetrahedral meshes in a distributed environment. Coarsening relies upon an edge collapsing tool. Re nement uses edge-based subdivision templates. Mesh optimization maintains the quality of the adapted meshes. Focus is given to the parallelization of the various components. Scalability requires repartitioning of t...

متن کامل

Domain Decomposition Preconditioning for High Order Hybrid Discontinuous Galerkin Methods on Tetrahedral Meshes

Hybrid discontinuos Galerkin methods are popular discretization methods in applications from fluid dynamics and many others. Often large scale linear systems arising from elliptic operators have to be solved. We show that standard p-version domain decomposition techniques can be applied, but we have to develop new technical tools to prove poly-logarithmic condition number estimates, in particul...

متن کامل

A novel geometric flow approach for quality improvement of multi-component tetrahedral meshes

This paper presents an efficient and novel geometric flow-drivenmethod for mesh optimization of multicomponent tetrahedral meshes with non-manifold boundaries. The presented method is composed of geometric optimization and topological transformation techniques, so that both location and topology of mesh vertices are optimized. Due to the complexity of non-manifold boundaries, we categorize the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Parallel and Distributed Computing

سال: 2017

ISSN: 0743-7315

DOI: 10.1016/j.jpdc.2017.04.008